HARD.LSP[F77,JMC] - www.SailDart.org

perm filename HARD.LSP[F77,JMC] blob sn#369006 filedate 1978-07-16 generic text, type C, neo UTF8

COMMENT ⊗   VALID 00002 PAGES
C REC  PAGE   DESCRIPTION
C00001 00001
C00002 00002	    SOME DIFFICULT LISP PROBLEMS
C00003 ENDMK
C⊗;
    SOME DIFFICULT LISP PROBLEMS

1. What is the fastest algorithm for occur[x,y], and for compactifying
a list structure.

2. Transform a recursive definition to iterative form using a stack.

3. is u a sublist of v (with skipping) better than

(defun issublist (u v) (or (null u) (and (not (null v)) (or
(and (equal (car u) (car v)) (issublist (cdr u) (cdr v)))
(issublist u (cdr v))))))

4. unification without making all new variables